Zen Puzzle Garden is NP-complete
نویسندگان
چکیده
• Once moving on sand, the monk continues to move in a straight line until he encounters either a walkable square (in which case he moves onto it) or a a raked square (in which case he stops moving). The monk may not turn corners during a single move while moving on sand. These two rules are central to the challenge of the game – if the monk could be moved over the sand on a square-by-square basis then most boards would be trivial to solve.
منابع مشابه
The Treatment of Japanese Garden based on Zen Philosophy in Mental Health
By designing conditions and relaxing spaces with the help of values and concepts of Japanesearchitecture, based on Zen's philosophy that based on simplicity, purity, avoidance of complexity and relaxation, ithas tried to bring an experience of relaxation to the audience. This article seeks to investigate a principled relationshipbetween the principles of Japanese gardens in accordance with the ...
متن کاملOn The NP-Completeness of The Nurikabe Pencil Puzzle and Variants Thereof
We show that the popular pencil puzzle Nurikabe is intractable from the computational complexity point of view, i.e., is NP-complete, even when the involved numbers are 1 and 2 only. To this end we show how to simulate Boolean gates by the puzzle under consideration. Moreover, we also study some Nurikabe variants, which remain NP-complete, too.
متن کاملSpiral Galaxies Puzzles are NP-complete
We will show that the question of whether or not a given Spiral Galaxies puzzle has a solution is NP-complete. To do so, we construct Spiral Galaxies puzzles which correspond to arbitrary Boolean circuits. A circuit will be satisfied, (that is, have a set of inputs which give the desired outputs) if and only if the corresponding puzzle has a solution. Since Satisfiability is the canonical NP-co...
متن کاملMastermind is NP-Complete
In this paper we show that the Mastermind Satisfiability Problem (MSP) is NPcomplete. Mastermind is a popular game which can be turned into a logical puzzle called the Mastermind Satisfiability Problem in a similar spirit to the Minesweeper puzzle [5]. By proving that MSP is NP-complete, we reveal its intrinsic computational property that makes it challenging and interesting. This serves as an ...
متن کاملThe Three-Color and Two-Color Tantrix Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
Holzer and Holzer [HH04] proved the Tantrix rotation puzzle problem with four colors NP-complete. Baumeister and Rothe [BR07] modified their construction to achieve a parsimonious reduction from satisfiability to this problem. Since parsimonious reductions preserve the number of solutions, it follows that the unique version of the four-color Tantrix rotation puzzle problem is DP-complete under ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 112 شماره
صفحات -
تاریخ انتشار 2012